A grid-aware MIP solver: Implementation and case studies
نویسندگان
چکیده
This paper presents a grid-enabled system for solving large-scale mixed integer programming (MIP) problems. The system has been developed using Globus and MPICH-G2, and consists of two solvers and of an interface portal. After a brief introduction to Branch, Cut and Price optimization algorithms, the paper focuses on the system architecture, solvers and portal user interface. The performance of system is measured and analyzed on a small-scale grid environment consisting of three clusters on a campus LAN.
منابع مشابه
Routing of barge container ships by mixed-integer programming heuristics
We investigate the optimization of transport routes of barge container ships with the objective to maximize the profit of a shipping company. This problem consists of determining the upstream and downstream calling sequence and the number of loaded and empty containers transported between any two ports. We present a mixed integer linear programming (MILP) formulation for this problem. The probl...
متن کاملA Pre-processing Aware RINS Based MIP Heuristic
This paper proposes an adaptation of the RINS MIP heuristic which explicitly explores pre-processing techniques. The method systematically searches for the ideal number of fixations to produce subproblems of controlled size. These problems are explored in a Variable Neighborhood Descent fashion until a stopping criterion is met. Preliminary experiments implemented upon the open source MIP solve...
متن کاملStrip Decomposition Parallelization of Fast Direct Poisson Solver on a 3D Cartesian Staggered Grid
A strip domain decomposition parallel algorithm for fast direct Poisson solver is presented on a 3D Cartesian staggered grid. The parallel algorithm follows the principles of sequential algorithm for fast direct Poisson solver. Both Dirichlet and Neumann boundary conditions are addressed. Several test cases are likewise addressed in order to shed light on accuracy and efficiency in the strip do...
متن کاملA Logic-Based Hybrid Solver for Optimal Control of Hybrid Systems
Combinatorial optimization over continuous and integer variables was proposed recently as an useful tool for solving complex optimal control problems for linear hybrid dynamical systems formulated in discretetime. Current approaches are based on mixed-integer linear/quadratic programming (MIP), which provides the solution after solving a sequence of relaxed standard linear (or quadratic) progra...
متن کاملAdaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Future Generation Comp. Syst.
دوره 24 شماره
صفحات -
تاریخ انتشار 2008